Evolving Ant Colony Optimization

نویسندگان

  • Hozefa M. Botee
  • Eric Bonabeau
چکیده

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-evolving Ant Colony Optimization and Its Application to Traveling Salesman Problem

Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to combinatorial optimization problems. However, in the ACO algorithms, it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this paper we proposed an improved ACO algorithm in which a s...

متن کامل

Evolving ant colony optimization based unit commitment

Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization ismore suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant col...

متن کامل

A systematic approach for estimation of reservoir rock properties using Ant Colony Optimization

Optimization of reservoir parameters is an important issue in petroleum exploration and production. The Ant Colony Optimization(ACO) is a recent approach to solve discrete and continuous optimization problems. In this paper, the Ant Colony Optimization is usedas an intelligent tool to estimate reservoir rock properties. The methodology is illustrated by using a case study on shear wave velocity...

متن کامل

Unit Commitment by Evolving Ant Colony Optimization

Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) f...

متن کامل

Evolving Strategies for Updating Pheromone Trails: A Case Study with the TSP

Ant Colony Optimization is a bio-inspired technique that can be applied to solve hard optimization problems. A key issue is how to design the communication mechanism between ants that allows them to effectively solve a problem. We propose a novel approach to this issue by evolving the current pheromone trail update methods. Results obtained with the TSP show that the evolved strategies perform ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Advances in Complex Systems

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1998